Multiple Kronecker covering graphs
نویسندگان
چکیده
منابع مشابه
Multiple Kronecker covering graphs
A graph may be the Kronecker cover in more than one way. In this note we explore this phenomenon. Using this approach we show that the least common cover of two graphs need not be unique.
متن کاملStochastic Kronecker Graphs
A random graph model based on Kronecker products of probability matrices has been recently proposed as a generative model for large-scale real-world networks such as the web. This model simultaneously captures several well-known properties of real-world networks; in particular, it gives rise to a heavy-tailed degree distribution, has a low diameter, and obeys the densification power law. Most p...
متن کاملGiant components in Kronecker graphs
Let n ∈ N, 0 < α, β, γ < 1. Define the random Kronecker graph K(n, α, γ, β) to be the graph with vertex set Z2 , where the probability that u is adjacent to v is given by pu,v = α u·vγ(1−u)·(1−v)βn−u·v−(1−u)·(1−v). This model has been shown to obey several useful properties of real-world networks. We establish the asymptotic size of the giant component in the random Kronecker graph.
متن کاملCovering Graphs: The Covering Problem Solved
For every fixed graph H, we determine the H-covering number of Kn, for all n > n0(H). We prove that if h is the number of edges of H, and gcd(H) = d is the greatest common divisor of the degrees of H, then there exists n0 = n0(H), such that for all n > n0, C(H,Kn) = d dn 2h dn− 1 d ee, unless d is even, n = 1 mod d and n(n− 1)/d+ 1 = 0 mod (2h/d), in which case C(H,Kn) = d ( n 2 ) h e+ 1. Our m...
متن کاملKRONECKER GRAPHS: AN APPROACH TO MODELING NETWORKS Kronecker graphs: an approach to modeling networks
How can we generate realistic networks? In addition, how can we do so with a mathematically tractable model that allows for rigorous analysis of network properties? Real networks exhibit a long list of surprising properties: Heavy tails for the inand out-degree distribution; heavy tails for the eigenvalues and eigenvectors; small diameters; and densification and shrinking diameters over time. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2008
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2007.07.001